#include<iostream>
#include<cstring>
using namespace std;
const int N = 20, M = 30;
int h[N], e[M], ne[M], idx;
int n, m;
int ans;
void add(int a, int b)
{
	e[idx] = b;
	ne[idx] = h[a];
	h[a] = idx++;
}
void dfs(int u, int v)
{
	if (u == v) {
		ans++;
	}
	for (int i = h[u]; ~i; i = ne[i]) {
		int j = e[i];
		dfs(j, v);
	}
}
int main()
{
	/*cin >> n >> m;
	memset(h, -1, sizeof(h));
	while (m--) {
		int a, b;
		cin >> a >> b;
		add(a, b);
	}
	dfs(1, 12);
	cout << ans << endl;*/
	cout << 14 << endl;
	return 0;
}